Algorithm for Modulo Addition KHALED

نویسندگان

  • KHALED M. ELLEITHY
  • MAGDY A. BAYOUMI
چکیده

When designing elliptic-function filters there is usually some margin in performance to be distributed over the defining parameters. A recent paper offered some comparatively complicated formulas for use in this stage of the design. However, a simpler method, originally due to Darlington, is available and i s described briefly. passband ripple is again given by (2). ‘The cd function is the same as the sn function by a real quarter period, just as the cosine is the same as the sine shifted by ~ / 2 . Using the cd function rather than the sn function as in [2], allows one to describe both odd and even degree cases with one common formula. Manuscript received April 28, 1989. This letter was recommended by The author is with the Electrical Engineering Department, University of IEEE Log Number 8930187. Associate Editor T. R. Viswanathan. California Los Angeles, Los Angeles, Ca 90024. OO98-4094/90/0500-oS31~$01 .OO 01990 IEEE Authorized licensed use limited to: University of Bridgeport. Downloaded on February 24,2010 at 11:38:37 EST from IEEE Xplore. Restrictions apply.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Systolic Architecture for Modulo Multiplication

With the current advances in VLSI technology, traditional algorithms for Residue Number System (RNS) based architectures should be reevaluated to explore the new technology dimensions. In this brief, we introduce A @(log n ) algorithm for large moduli multiplication for RNS based architectures. A systolic array has been designed to perform the modulo multiplication Algorithm. The proposed modul...

متن کامل

Modular Multipliers Using a Modified Residue Addition Algorithm with Signed-Digit Number Representation

In this paper, we present multipliers using a modified addition algorithm modulo m with a signed-digit(SD) number representation where m = 2 − 1, 2 or 2 + 1. To simplify an SD modular adder, new addition rules are proposed for generating the intermediate sum and carry with a binary number representation. By using the new codes for intermediate sum and carry and the end-around carry architecture...

متن کامل

Hereditary properties of amenability modulo an ideal of Banach algebras

In this paper we investigate some hereditary properties of amenability modulo an ideal of Banach algebras. We show that if $(e_alpha)_alpha$ is a bounded approximate identity modulo I of a Banach algebra A and X is a neo-unital modulo I, then $(e_alpha)_alpha$ is a bounded approximate identity for X. Moreover we show that amenability modulo an ideal of a Banach algebra A can be only considered ...

متن کامل

Low Power Modulo 2+1 Adder Based on Carry Save Diminished-One Number System

Modulo 2+1 adders find great applicability in several applications including RNS implementations. This paper presents a new number system called Carry Save Diminished-one for modulo 2+1 addition and a novel addition algorithm for its operands. In this paper, we also present a novel architectures for designing modulo 2+1 adders, based on parallel-prefix carry computation units. CMOS implementati...

متن کامل

A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two

Linear approximations of modular addition modulo a power of two was studied by Wallen in 2003. He presented an efficient algorithm for computing linear probabilities of modular addition. In 2013 Schulte-Geers investigated the problem from another viewpoint and derived a somewhat explicit formula for these probabilities. In this note we give a closed formula for linear probabilities of modular a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004